Group distance magic Cartesian product of two cycles

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group distance magic labeling of Cartesian product of cycles

A group distance magic labeling of a graph G(V, E) with |V | = n is an injection from V to an abelian group Γ of order n such that the sum of labels of all neighbors of every vertex x ∈ V is equal to the same element μ ∈ Γ. We completely characterize all Cartesian products Ck Cm that admit a group distance magic labeling by Zkm.

متن کامل

Distance magic Cartesian product of graphs

24 A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection 25 l : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum 26 of the labels on the vertices in the open neighborhood of v, is a constant. 27 In this paper, we show that hypercubes with dimension divisible by four 28 are not distance magic. We also provide some positive results by providing ...

متن کامل

Hyperhamiltonicity Of The Cartesian Product Of Two Directed Cycles

Let Za × Zb be the product of two directed cycles, let Zc be a subgroup of Za, and let Zd be a subgroup of Zb. Also, let A = a c and B =

متن کامل

Coloring the square of the Cartesian product of two cycles

The square G2 of a graph G is defined on the vertex set of G in such a way that distinct vertices with distance at most two in G are joined by an edge. We study the chromatic number of the square of the Cartesian product Cm2Cn of two cycles and show that the value of this parameter is at most 7 except when m = n = 3, in which case the value is 9, and when m = n = 4 or m = 3 and n = 5, in which ...

متن کامل

b-coloring in Square of Cartesian Product of Two Cycles

A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each color class contains a color dominating vertex, that is, a vertex which has at least one neighbor in each of the other color classes. The largest integer k(>0) for which G has a b-coloring using k colors is the b-chromatic number b(G) of G. In this paper, we obtain the b-chromatic number of the square...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2020

ISSN: 0012-365X

DOI: 10.1016/j.disc.2019.111807